Method and apparatus for cryptographically camouflaged cryptographic key storage, certification and use

ABSTRACT

A digital wallet stores an cryptographically camouflaged access-controlled datum, e.g., a private key encrypted under the user&#39;s PIN. Entry of the correct PIN will correctly decrypt the stored key. Entry of certain pseudo-valid PINs will also decrypt the stored key, but improperly so, resulting in a candidate key indistinguishable from the correct key. Such pseudo-valid PINs are spread thinly over the space of PINs, so that the user is unlikely to realize a pseudo-valid PIN via a typographical error in entering the correct PIN. In existing wallet technologies, which lack pseudo-valid PINs, only the correct PIN produces a decrypted key; thus, hackers can find the correct PIN by entering all possible PINs until a key is produced. The present invention&#39;s plurality of candidate keys prevent a hacker from knowing when he has found the correct key. In addition, hacker detection may be moved off-line into devices accepting messages signed with candidate keys, and/or the lockout threshold may be increased. Thus, the wallet can be forgiving of typographic or transposition errors, yet a hacker trying large numbers of PINs will eventually guess a pseudo-valid (but still incorrect) PIN and recover a candidate private key whose fraudulent use will be detected. The wallet may be used with associated key generation, certification, and verification technologies. Such technologies may include pseudo-public keys embedded in pseudo-public certificates, i.e., public keys that are not generally known and which are contained in certificates that are verifiable only by entities so authorized by the certifying authority.

FIELD OF THE INVENTION

The invention relates generally to cryptographically securing anaccess-controlled datum and, more specifically, to secure cryptographickey storage and use.

BACKGROUND OF THE INVENTION

Cryptographic data security techniques secure data by encrypting thedata with a key. The decrypted data can only be recovered using the key.The key is selected to be sufficiently long that a malicious intrudercannot guess the key by exhaustive trial and error, even with the use ofsubstantially large amounts of computing resources. Therefore, thesecurity of the data has been transferred to the security of the key.Often, it is desirable to store the key so that access to the key iscontrolled by a pass-phrase or PIN (Personal Identification Number) thatis short enough for a human user to remember easily. This wouldconveniently enable the human user to use his PIN to recover the key,and then use the key to recover the encrypted data. Unfortunately, ifthe PIN is short enough for the human to remember, it is also shortenough for a malicious intruder to guess by exhaustive trial and error,thereby undermining the security of the key, and hence the security ofthe encrypted data. This has long been a vexing problem in datasecurity. In the present invention, we will offer a solution to thisproblem, using a fundamentally new technique called cryptographiccamouflaging. In contrast with conventional methods that aim to concealthe key, this new technique will camouflage the key by embedding it in amultitude of apparently similar keys. The keys are sufficientlydifferent that the legitimate owner of the data can locate the correctkey without any difficulty, using a short PIN that he can remember. Yet,the keys are sufficiently alike that a malicious intruder will find allof them equally plausible. The only way the intruder can select thecorrect key via trial and error, is to verify his trials with either theowner of the key, or with an administrative authority, thereby exposinghimself. While the discussion that we will present is in the exemplarycontext of storing private keys for digital signatures, those skilled inthe art will readily recognize that the technique of cryptographiccamouflage can be used to secure other forms of data.

We now return to our discussion of the background of the invention. Inasymmetric cryptographic methods such as RSA, each user holds a matchedpair of keys, a private key and a public key. The private key and thepublic key form a unique and matched pair in that messages (e.g.,messages, data, code, and any other digitally representable informationincluding other cryptographic keys or cryptographic representations ofinformation) that are encrypted with the private key can only bedecrypted with the public key and vice versa. This one-to-onecorrespondence between the private key and the public key can be used tocreate digital signatures for electronic messages and transactions. Inorder to sign an electronic message, a user can simply encrypt themessage with his private key. He would then attach his public key to theencrypted message and send it to the recipient. Alternatively, the userwould not attach his public key to the message, but the recipient couldlook up the user's public key in a directory of public keys. In eithercase, to verify the signature, the recipient would decrypt the messageusing the attached public key, and if the decryption is successful, therecipient is confident of the origin of the message.

As described above, the sender would have to encrypt the entire messagewith his private key to sign it, which is computationally expensive. Toaddress this, it suffices to compute a short hash of fixed length, say128 bits long, of the message and then encrypt the hash value. If thehash function is a good one, such as MD5, the chances of two distinctmessages having the same hash value is extremely small. Therefore,digital signature methods typically compute hashes of messages, andencrypt only the hash value. The encrypted hash value and the public keyof the sender are attached to the original message prior to transmissionto the recipient. To verify the signature, the recipient would firstcompute the hash of the received message. If the computed hash value isthe same as the decrypted form of the encrypted hash, the recipient isconfident of the origin of the message.

In the foregoing, the strength of the signature verification processdepends on the recipient's confidence that the public key attached tothe message is indeed the public key of the purported owner. Anybody cangenerate a matched pair of keys can masquerade as the user, unless thereexists a means to prevent such a masquerade. To this end, public keysare often certified by third-party notaries called certifyingauthorities or CAs for short. Examples of certifying authorities arecommercial entities such as Verisign and Entrust. The CA binds acertifiee's public key with the certifiee's identity, and then signs thecombined message with the CA's private key, to form the certifiee'spublic key certificate. Thus, a certificate holder would attach hispublic key certificate to the encrypted message prior to sending themessage to the recipient. To check the sender's identity and theauthenticity of his public key, the recipient verifies the CA'ssignature on the sender's public key certificate, using the CA's publickey. Since there would only be a small number of widely trusted CAs, theCA's public key would be reliably and easily available to the recipient.Thus, public key signatures can be used for stranger-to-strangerauthentication in that even if the recipient and the sender have noprior relationship, the recipient can verify the sender's signature aslong as the recipient and the sender both trust a common CA.

The uniqueness and unforgeability of a user's signature depend verystrongly on the ability of the user to keep his private key private.Anybody who has access to the private key of a user can masquerade asthat user with complete anonymity. Hence, widespread use of digitalsignatures for electronic commerce and other applications will requiretechnology for the secure storage of private keys. At present, it iswidely believed that private keys are best stored by physicallyisolating them on hardware devices such as smart cards, Fortezza cards,PCMCIA cards and other compact hardware devices. Smart cards arecredit-card sized cards that contain a microprocessor and some memory.The user's private key and public key certificate are written onto thememory. To use the card, the user would simply insert the card into anappropriate card reader connected to a host computer, and then enter hisPIN to activate the card. If the correct PIN is entered, the on-cardprocessor would release the private key for use on the host computer. Ifan incorrect PIN is entered, the processor would not release the user'sprivate key. Some tamper-resistant smart cards are configured so that ifincorrect PINs are entered on several consecutive activation attempts,the card locks up permanently. Some sophisticated smart cards (oftencalled cryptocards) can perform cryptographic operations, so that theprivate key need never leave the smart card. The bytes to be processedenter the smart card from the host computer, are processed, and are thentransmitted back to the host computer. Unfortunately, even cryptocardsmust rely on the host computer for transmitting the bytes back and forthfrom the card reader and are therefore not perfectly secure. A malicioushost computer could simply substitute one message for another prior totransmission, so that the user thinks he is signing one message, whilein fact he is signing another. Therefore, even cryptocards cannot combatmalicious host computers.

While the smart card solves the problem of securely storing privatekeys, it suffers from several significant drawbacks:

1) High Initial Cost: Smart cards require expensive additional hardwareinfrastructure in the form of smart card readers;

2) Administrative Overhead: Smart cards require administrative overheadfor distribution and upkeep; and

3) Low User Convenience: The user cannot duplicate, backup or collatesmart cards, owing to their tamper proof features.

A secure software-based key wallet that does not require additionalhardware would mitigate some of the drawbacks of the smart card listedabove. Unfortunately, there are no such solutions presently available.The standard technology that is used today for key storage, in productssuch as those of Microsoft and Netscape, offers very little protectionagainst tampering, and can be broken into rather easily. Specifically,these key wallets store the private key in encrypted form, using theuser's PIN as the encryption key. The PIN must be short enough for theuser to remember, say a six-digit code. If such a software key walletfalls into the hands of a hacker, the hacker could exhaustively try allone million possible six-digit codes in an automated fashion on apersonal computer within a few minutes, until he finds the code thatopens the key wallet. At this point, the hacker knows that he hasexactly the correct PIN, and has access to the user's private keys.Thus, the primary problem with providing a software-only key wallet arethe competing requirements that the PIN be short enough for the user toremember, but long enough to make the key wallet tamper resistant.

BRIEF DESCRIPTION OF THE FIGURES

FIG. 1 is a schematic overview of a cryptographic key wallet and keygeneration, key certification, and verification subsystems.

FIG. 2 illustrates a conventional key wallet.

FIG. 3 illustrates an exemplary embodiment of a key wallet according tothe present invention.

FIG. 4 illustrates a distribution of pseudo-valid PINs among the spaceof all possible PINs.

FIG. 5 illustrates a neighborhood surrounding a correct PIN.

FIG. 6 illustrates a known-plaintext attack that is addressed by asigning aspect of the present invention.

FIG. 7 illustrates an exemplary embodiment of a signing aspect of thepresent invention.

FIG. 8 illustrates an exemplary embodiment for generating well-formedprivate keys in a key generation aspect of the present invention.

FIG. 9 illustrates an exemplary system for digitally signing a message,including a key wallet and associated key generation logic.

FIG. 10 illustrates a known public key attack that is addressed by apseudo-public certificate aspect of the present invention.

FIG. 11 illustrates a conventional and an exemplary pseudo-publiccertificate.

FIG. 12 illustrates an exemplary certificate server aspect of thepresent invention.

SUMMARY OF THE INVENTION

The present invention offers a new technique for data storage calledcryptographic camouflaging. In contrast with conventional cryptographicmethods that aim to conceal the data, the present invention camouflagesthe data by embedding it amongst many pieces of similar data. Theembedding is varied in that the pieces of data are sufficientlydifferent that the legitimate owner of the data can locate the correctpiece without any difficulty, using a short PIN that he can remember.Yet, the embedding is homogenous, in that the pieces of data aresufficiently alike that a malicious intruder will find all of themequally plausible. The only way the intruder can select the correct datavia trial and error is to verify his trials with either the owner of thedata, or with an administrative authority, thereby exposing himself.

Preferably, the multitude of data pieces selected for the embeddingsatisfy the competing constraints of being sufficiently varied for theconvenience of the legitimate owner, and yet sufficiently homogenous tofoil the malicious intruder. Those skilled in the art will realize thatsuch an embedding may be tailored to the specific context of eachparticular application. In this specification, we discuss an exemplaryapplication of storing private keys in a key wallet, compatible withexisting public key signature methods such as RSA, DSS, El-Gamal,elliptic curve cryptosystems, and their associated key generation,verification and certification technologies. Those skilled in the artwill also realize that the technique of cryptographic camouflaging canalso be applied to other embodiments, by following the general methodsof the exemplary embodiment. Therefore, the term key wallet (or,alternatively, digital wallet) should be understood generally to referto any device for storing cryptographic camouflaged access-controlleddatum rather than only the exemplary embodiment described herein.

A key wallet may be implemented as a software wallet, which the userwould unlock, using a PIN, in much the same way as he would use a smartcard. The advantages of a software-based wallet scheme include:

1) Low Cost: The system does not require additional hardwareinfrastructure. The wallet can be embodied in any digital storage mediumincluding floppy disks, hard disks, magnetic stripe cards, and evensmart cards themselves;

2) Low Administrative Overhead: The wallet can be distributedelectronically and updated electronically as required;

3) High User Convenience: The user can duplicate, backup, and collatewallets. Wallets can also be transmitted electronically;

4) Tamper Resistance: The wallet can be tamper resistant in functionallythe same sense as a smartcard; and

5) No Undue Burden on User: The user's experience with the wallet wouldbe the same as that with the smart card, and the user would not requireunusually long PINs, or require extreme care in entering PINs, etc.

Other associated aspects of the present invention relate to the creationand management of public-key certificates usable with the above keywallet. The advantages of such certificates include:

1) Limited liability: The public key is pseudo-public, and its use islimited explicitly to authorized verifiers who are authorized by thecertifying authority. This could also, as a practical matter, limit thelegal liability of the certifying authority.

2) Certificate Revocation: Public-key certificates may be created thatare only useful to authorized verifiers; thus, revocation of thecertificates is facilitated to the extent that only the authorizedverifiers need to be notified of the cancellation of a certificate.

Of course, although there are many advantages to a software-onlyimplementation of the present invention, parts or all of the systemcould even be implemented in a combination of hardware and software, oreven purely in hardware, providing great flexibility for deployment andusage. We first describe a metaphor for the cryptographicallycamouflaged key wallet system, followed by a summary of a technologicalrealization thereof.

Consider the problem of selecting a lock for the main door of a home. Wecould select a small, inexpensive lock with a key that is small enoughto be carried conveniently. Or we could select a large, strong lock,with a big key that is difficult to carry around conveniently. A thirdalternative is a strong electronic lock with a key card, such as thoseused in hotels and other institutions. Such electronic locks areexpensive and involve some administrative overhead, but they are bothconvenient and secure. Metaphorically speaking, the inexpensive locksrepresent the simple passwords that are widely used to protect computingresources; the strong locks with the big keys represent public keymethods—they are powerful but cumbersome; the electronic key card locksrepresent public key authentication methods with smart cards for storingthe keys. In this metaphor, the conventional software solution forprivate key storage is equivalent to hiding the key under the doormat.The user locates the key under the doormat using his PIN. Unfortunately,it is easy for the malicious hacker to exhaustively search under thedoormat until he finds the key. In contrast, using the presentinvention, the user could hide 10,000 keys under the doormat. One ofthese keys is the correct key and will unlock the door. The remainingkeys will either not work and/or set off alarms when used. The keys arecarefully specified to be sufficiently different so that the legitimateuser can find the correct key easily even in the dark. However, the keysare sufficiently alike that all of them look equally plausible to theintruder, and selection of one wrong key does not give useful feedbackas to a next key to try.

The key wallet aspect of the present invention is a technologicalrealization of the above metaphor of cryptographic camouflaging. In oneembodiment thereof, the key wallet stores the private key in encryptedform, where the encryption key is the user's PIN. The user recovers hisprivate key using his PIN, which is typically a six-digit code. If theuser enters exactly the correct PIN, he will recover his private keycorrectly. If the user enters an incorrect PIN, one of two things willhappen: (a) the key wallet will not open; or (b) the key wallet willopen and an incorrect private key will be recovered. For example, of the1,000,000 possible six-digit PIN codes, 10,000 of them will result inthe key wallet opening and yielding a candidate private key. However,only one of these candidate private keys will be the correct privatekey. The others will be incorrect keys that will nevertheless look justas plausible as the correct private key. As with the metaphor above, thelegitimate user will be able to locate the correct private key, since heknows the true PIN. The malicious hacker who exhaustively tries allpossible PINs will recover all 10,000 candidate private keys, all ofthem equally plausible. The only way the hacker can find out which ofthese keys is the correct one is to use the keys at some enterpriseauthorized to accept them. This would, with high likelihood, expose thehacker as an intruder. In the foregoing, the user of the key wallet is aperson accessing the private key contained therein. Alternatively, theuser need not be a person, but could be an application program, ahardware device, or some agent of a person. However, as a matter ofconvenience, the term user shall be used herein in the exemplary contextof a person accessing the key wallet.

The foregoing describes an exemplary implementation of cryptographiccamouflaging, directed at secure storage of private keys using a PIN.Those skilled in the art will realize, however, that the presentinvention is usable generally for secure storage of anyaccess-controlled datum (ACD) using any digitally representable accesscode. Therefore, the term key wallet (or, alternatively, digital wallet)should be understood generally to refer to any device for storingcryptographic camouflaged access-controlled datum rather than only theexemplary embodiment described herein. Finally, still other relatedaspects of the invention include key generation, verification andcertification technologies, as will be explained in detail below.

Persons skilled in the art will recognize that applications of thepresent invention include, but are not limited to: (a) strongauthentication for secure remote/local access to computing and storageresources; (b) reduced user sign-on in environments with multiplecomputers on a network; (c) strong authentication for secure accessthrough firewalls with or without the IPSEC network protocol; (d)digital signatures for secure electronic commerce transactions; (e)digital signatures for electronic payment mechanisms; (f) secure accessto databases and/or digital signatures for database transactions; (g)secure access to routers and network switches; (h) secure access todistributed services; and (i) embedded applications wherein the user(e.g., of the digital wallet) is represented by a computational agent,such as a program running in software or hardware, as applied to, butnot limited to, any of the aforementioned applications.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 gives a schematic overview of functional elements of the overallsystem, each of which plays a role in the secure storage of the privatekey and its subsequent use. The first component is the key generationcomponent 100, which creates the public and private keys for the user.The second component is the key wallet 110, which stores the private keyand is used to create signatures. The third component is theverification component 120, which is used to verify the signaturescreated by the key wallet. The fourth component is the certificationcomponent 130, which is used to certify the public key created by thekey generation component. The key wallet component provides theembedding for the cryptographic camouflaging, while the other elementsensure that the embedding is sufficiently varied to be of convenience tothe legitimate user, and yet appears sufficiently homogeneous to foilthe malicious intruder. In an exemplary embodiment of the invention, theforegoing are implemented as software running on a general purposecomputer.

1. Details of the Key Wallet

For the purpose of analysis, we consider the key wallet to be asoftware-based lockbox containing the user's private key. Assume alsothat the lockbox can only be unlocked by a secret PIN that is known onlyto the legitimate user. Suppose the key wallet falls into the hands of amalicious hacker. We enumerate the kinds of attacks the hacker can mounton the black box, and provide a means to resist each attack. In theinterest of clarity, the discussion will be set forth with respect tothe RSA public key signature system. However, those skilled in the artwill appreciate that the basic elements of the discussion are applicableto other systems as well, including, without limitation, the El-Gamaland DSS signature systems, and elliptic curve cryptosystems.

a. PIN Hash Attack

A conventional key wallet is depicted schematically in FIG. 2. A PIN 200(more generally, an access code) entered to unlock the wallet is passedthrough a one-to-one hash function 210. The hash function may alsoinclude a salt value or other security-enhancing feature, as will beappreciated by persons skilled in the art. The hashed value 215 of theentered PIN is compared with a stored hash value 220, which is thehashed value of the correct PIN. If the two hash values agree, the PINis passed to decryption module 240. The private key which has beenencrypted (with the correct PIN as the encryption key) and stored infield 230, is decrypted by decryption module 240, which is typically DESor some other cryptographic function such as, for example, triple-DES,IDEA or BLOWFISH. Hence, the decrypted private key 250 is released foruse.

The cryptographic operations of computing the hash(es) and decryptingthe stored hash may be implemented using one or more cryptographic logic(e.g., software) modules, and the correct hash value and private key maybe stored in protected data fields or other forms of memory (e.g., readfrom ROM, from computer-readable media, etc.). A typical key walletwould also include input and output logic for receiving candidate PINsand outputting decrypted private keys, as well as logic for management,viewing, copying, and handling of keys and other data.

The one-to-one nature of the hash function ensures that the correct PINand only the correct PIN will unlock the key wallet. Unfortunately, italso provides the malicious hacker complete information to automate theprocess of guessing the correct PIN. In a typical implementation, thePIN is a code of six or fewer digits. The hacker simply has to find thesix-digit code that hashes to the stored hashed value. If he gets a copyof the key wallet, he can carry out this attack on his computer,completely undetected and in an automated fashion, in a matter of a fewminutes. For example, he might write a program that simply checks allsix-digit PIN codes on the key wallet.

To resist the PIN hash attack, the present invention replaces theone-to-one hash with a many-to-one hash, i.e., a hash in which manyinputs produce (i.e., regenerate) the same hashed output. This isdepicted in the flow chart of FIG. 3. In a typical implementation, themany-to-one hash finction 310 might hash six-digit codes to two-digithash values. As in the conventional key wallet, the hashed value 315 ofthe entered PIN 300 is compared with the stored hash value 320, which isthe hashed value of the correct PIN. If the two hash values agree, thekey wallet opens. The private key is again stored encrypted in field 330of the key wallet, with the correct PIN as the encryption key. When thecorrect PIN is entered, the stored encrypted key is decrypted and thecorrect private key 350 is released for use. However, since the hashfunction is many-to-one, there will be many different entered PINs thatwill open the key wallet. (PINs that hash to the same hash value as thecorrect PIN, including the correct PIN, are called pseudo-valid PINs.)For example, if the hash function hashes six-digit codes to two-digithash values, there will be 10,000 six-digit pseudo-valid PINs that willopen the key wallet, out of a total of 1,000,000 possible six-digitcodes. Pseudo-valid PINs will all be passed to the decryption module 340to decrypt the stored encrypted key to produce a candidate private key.However, all but one of these candidate private keys will be incorrectdecryptions of the stored (correct) private key. Only when the enteredPIN is the correct PIN will the correct private key be recovered.

Preferably, the many-to-one hash function above should be chosen to be agood hash. For example, and without limitation, MD5 and SHA arewell-known good hash functions. Good hash functions are one means tosubstantially uniformly distribute the pseudo-valid PINs in the space ofall possible PINs. For example, consider a hash function from six-digitcodes to two-digit hash values. Of the 1,000,000 possible input values,10,000 will be pseudo-valid PINs. If the hash function is a good hash,these values will be substantially uniformly distributed. In particular,one in a hundred PINs will be pseudo-valid, and these will beeffectively randomly distributed. Specifically, the chances are 1/100that if the user makes a typographical error in entering the correctPIN, then the resulting PIN will be a pseudo-valid PIN. Pictorially,this is seen in FIG. 4, where the space of all possible PINs is shown asa wall 400. The holes 410 in the wall correspond to the pseudo-validPINs. Only one of these holes 420 corresponds to the correct PIN, asshown in the figure. Notice that there is a neighborhood of PINs aroundeach pseudo-valid PIN that will not hash to the stored hash value.Compare this with FIG. 5, which shows the space of PINs for a one-to-onehash as used in the conventional key wallet. Notice that FIG. 5 showsonly one hole 510, corresponding to the correct PIN. Also notice thatthe local neighborhood of the correct PIN in FIG. 4 looks like theneighborhood of the correct PIN of FIG. 5. In this sense, the legitimateuser's experience with the key wallet of the present invention is verysimilar to his experience with the conventional key wallet.

Another possible scenario involves using a weak hash, i.e., one whichresults in clustering of pseudo-valid PINs, whereby an intruder whoguesses one pseudo-valid PIN will more easily find others. A legitimateuser making a series of 1-digit typographical errors would also get asequence of pseudo-valid PINs and, if the system accepting the privatekey or messages encrypted thereby has analarm-or-disable-upon-repeated-failure feature, this would inadvertentlylock out the legitimate user. Thus a weak hash is typically disfavoredover the good hash. Nevertheless, there may be some applications where aweak hash provides certain characteristics such as computationalefficiency and ease of implementation that are advantageous forspecialized applications.

b. Known Signature Attack

Another common attack is the known signature attack. In this attack,sometimes called a known-plaintext attack, the malicious hacker hasaccess to two pieces of information: (a) the user's key wallet; and (b)a message (in both plain text and signed form) that was previouslysigned by the user. This attack is shown pictorially in FIG. 6. Thehacker will try all possible PINs 600 on the key wallet, and for eachpseudo-valid PIN, use the decrypted private key 610 to sign the knownplain text 620, creating a signature 630. If the signature 630 matchesthe known signature of the user 640 of the same plain text message, thehacker knows that he has discovered the correct PIN and has recoveredthe user's correctly decrypted private key. In the conventionalsignature process, the plain text message to be signed is hashed using ahashing algorithm (such as MD5), and the hashed plain text is encryptedusing the user's private key to form the signature. Often, apseudo-random pad is added to the plain text prior to hashing to resistchosen plaintext attack. Such pseudo-random bits are typically generatedfrom a seed that is stored on the key wallet, or some other source thatcan be traced and replicated, such as the time of day, etc. Adisadvantage of such pseudo-random bits is that an attacker whodetermines the randomness generation mechanism can obtain usefulfeedback for the known signature attack. Thus, an aspect of the presentinvention resists this attack via a variation on the signature process.

As shown in FIG. 7, the signing component of the present invention padsthe hashed plain text 720 with strongly random bits 710, prior toencryption with the private key 730, to create a non-replicatablesignature 740. Such strongly random bits may be generated using a methodthat relies on a source of randomness outside the key wallet. Examplesof such are physical sources of randomness, such as the variation in theseek time of the disk drive on a host computer, the random timeintervals between keystrokes on a keyboard, or random characters inputby a user. These and other methods for generating strong randomness arewell known to those skilled in the art (e.g., see D. Davis, R. Ihaka,and P. Fenstermacher, “Cryptographic Randomness from Air Turbulence inDisk Drives,” Advances in Cryptology: Proc. Crypto 84, Springer-Verlag,1985, pp. 183-215; or, more generally, Bruce Schneier, AppliedCryptography, 2nd Ed., Wiley, 1996). The purpose of such strong randompads is to ensure that signatures cannot be replicated by a malicioushacker, since he does not know the random pad, and cannot recreate therandom pad from any information stored in the key wallet as might be thecase with a pseudo-random pad. Still other applications of strongrandomness to dissuade attacks are well known to those skilled in theart, and can be implemented in alternative embodiments of the presentinvention.

c. Ill-Formed Key Attack

Another attack is one in which the malicious hacker tries all possiblePINs and, for each pseudo-valid PIN, examines the decrypted key. If thekey is not well formed, the hacker knows that the pseudo-valid PINcannot be the correct PIN. Therefore, it is necessary to ensure thatcandidate private keys, derived by decrypting the stored key withpseudo-valid PINs, are also well-formed.

In the RSA system, a private key has an exponent (d) and a modulus (n),and is said to be well-formed if the modulus does not have any smallfactors and the exponent d is smaller than (p-1)(q-1) and not divisibleby p or q, where p and q are the prime factors of the modulus n.Therefore, the modulus and exponent of candidate private keys must alsomeet these conditions. One embodiment of the present invention thatensures both conditions is shown in FIG. 8. Assuming the correct privatekey was properly formed, the modulus 810 is stored unencrypted and isnot modified by the encryption/decryption process. Therefore, thecandidate private key's modulus is well formed by definition. Theproblem, then, is ensuring that the candidate private key's exponent(hereafter, the “candidate exponent”) is well-formed. The likelihood ofthe candidate exponent sharing prime factors with the modulus isextremely small, and comparable with the likelihood of factoring themodulus serendipitously. Therefore, the primary constraint is on thesize of the candidate exponent relative to the modulus. One way ofensuring this is as follows. Since the exponent of the correct privatekey (hereafter, the “correct exponent”) was well-formed, candidateexponents that are similar in size to the correct exponent are likely toalso be well-formed.

One method of ensuring this is to divide the correct exponent into itsmost significant portion 820 and least significant portion 830. Forexample, 65537 has “65” as its most significant 2 digits and “537” asits least significant 3 digits. The most significant bits are storedunencrypted, while only the least significant bits of the correctexponent are encrypted using the PIN and stored. When the stored leastsignificant bits are decrypted using a pseudo-valid PIN, they willchange completely (e.g., 537 might become 142 in the example above). Thestored most significant portion and the decrypted form of the leastsignificant portion are then assembled to recover the candidate exponent840. However, the magnitude of the reassembled candidate exponent willnot have changed significantly. By properly choosing the number of leastsignificant bits, one can control the order of magnitude of therecomputed candidate exponent, to ensure that it remains smaller thanthe modulus. The foregoing illustrates the concept ofleast-significant-bit-encryption using base-10 arithmetic. Thecorresponding computer-based implementation would be similar, exceptusing bits rather than digits. For example, if the modulus has 512 ormore bits, an exemplary implementation might encrypt only the 128 leastsignificant bits of the exponent using the PIN as the key.

Those skilled in the art will realize that there are many alternativeways of ensuring that candidate private keys are well-formed. In analternative method, the key generation module selects two random numbersk and m, where m is a number between d and the modulus n. In anexemplary implementation, k could be of length 64 bits. The sum d+km iscomputed, k is discarded, and m is stored for later use. Rather thanstoring the correct exponent d, the sum d+km is then encrypted using thePIN, and stored as an encrypted sum. When a pseudo-valid PIN is entered,the encrypted sum is decrypted to obtain the decrypted sum, which isthen evaluated modulo m. That is, a candidate exponent is recovered asthe remainder after dividing the decrypted sum d+km by m. Such acandidate exponent is, by construction, smaller than m. Since m wasselected to be smaller than the modulus n, the candidate exponent istherefore also guaranteed to be smaller than n.

The foregoing illustrates two exemplary embodiments for ensuringwell-formedness of RSA-compatible candidate private keys. As thoseskilled in the art will appreciate, the concept of ensuringwell-formedness also extends to other private keys and, more generally,to other types of stored, access-controlled data. For example andwithout limitation, if the stored datum were a combination to a physicalsafe, the candidate datum would have to be in proper format for thecombination dial. Any access-controlled datum having an expected formatcan be stored using this aspect of the present invention in whichwell-formedness is ensured during decryption by candidate access codes.

d. Combination Attacks

To simultaneously resist the PIN hash attack, the known signature attackand the ill-formed key attacks, the various aspects of the presentinvention as shown in FIG. 3, FIG. 7 and FIG. 8 can be combined as shownin the assembly of FIG. 9. Persons skilled in the art will recognizethat any combination, subset or superset of the attacks can be resistedby combining (or modifying) the appropriate aspects of the presentinvention, for use in environments where that particular combination,subset or superset of the attacks is of concern.

2. Details of the Certification Component

The certification component of the present invention creates pubic keycertificates that are somewhat different from the conventional publickey certificates. Essentially, public keys as used herein are not trulypublic as with conventional methods, but are meant for limiteddistribution (e.g., within organizations, across intranets or otherwisewithin closed or pseudo-public enterprises). This deviation fromconventional methods is used to resist the following attack on theprivate key.

a. Known Public Key Attack

In this attack, the malicious hacker has access to two pieces ofinformation: (a) the user's key wallet, and (b) the user's public key,as might be readily available in a public key certificate directory. Theattack is shown pictorially in FIG. 10. The hacker will try all possiblePINs 1000 on the key wallet, and for each pseudo-valid PIN, he would usethe decrypted private key 1010 to encrypt an arbitrarily chosen samplemessage 1020, and then decrypt the encrypted message with the user'spublic key. If the decrypted message 1040 matches the plain text samplemessage, the hacker knows that he has discovered the correct PIN andrecovered the user's correctly decrypted private key.

To resist this attack, one embodiment of the present invention does notpermit public keys to be truly public. As a matter of convenience, weshall call such limited-distribution public keys “pseudo-public keys”and we shall call certificates containing such pseudo-public keys“pseudo-public certificates.” Specifically, pseudo-public certificatescontain the user's pseudo-public key in encrypted form. Only authorizedparties can access a pseudo-public key to verify the user's signature.This is in strong contrast with the conventional use of public keycertificates, where anybody can verify a public key signature. Ofcourse, the key wallet and other aspects or embodiments of the presentinvention could be used with conventional certificates alone, but evengreater security is provided if pseudo-public keys and certification arealso used, as described herein. Those skilled in the art will readilyappreciate that existing certification issuance devices and proceduresmay readily be adapted to accommodate the foregoing embodiment of thepresent invention. Therefore, the specific hardware and/or softwareimplementations of this embodiment of a certification component need notbe described in detail. Rather, only the differences from theconventional certificates will be described below. Readers skilled inthe art will recognize that conventional certificates come in severalformats, most notable of which is the X.509 format and its revisions;however, the essential elements of all the conventional formats aresimilar, when viewed in relation to the present invention.

A conventional public key certificate and one possible embodiment of apseudo-public certificate are shown side by side in FIG. 11. Theexemplary pseudo-public certificate may have the same format as theconventional certificate. However, the body of the certificate 1100containing the pseudo-public key is encrypted in a manner that isreadable only by an authorized verifier. For example, in oneimplementation, the encryption could be by the public key of theauthorized verifier. Only authentication servers that have access to thecorresponding private key can unwrap the user's certificate to accessthe user's public key. If there are several authorized verifiers, thebody of the certificate could carry several encrypted copies of thepseudo-public key, each copy being encrypted by the public key of one ofthe verifiers. Each enterprise or entity employing this aspect of thepresent invention would have a certificate server having theabove-described certification components to support its pseudo-publiccertificates. Persons skilled in the art will appreciate that theimportant characteristic of the pseudo-public certificate is that thepublic key is encrypted and can be decrypted only by authorizedverifiers, and this characteristic may be achieved in many differentways using a variety of cryptographic algorithms. For example, in analternate embodiment of the pseudo-public key certificate, the publickey would be encrypted by a DES key, and the DES key would be encryptedby the public key of the authorized verifier.

The resulting certificate would then be signed by the certifyingauthority similar to a conventional certificate. It is the pseudo-publicnature of public keys in the present invention that provides for twosignificant advantages in key management. Firstly, since the certifyingauthority is explicitly aware of who is authorized to use the public-keycertificates, the legal liability of the CA could, as a practicalmatter, be limited. This is in contrast to the conventional certificatewhere the CA has no prior knowledge of who will use the certificate.Secondly, revoking a public-key certificate is made easy, since the CAonly has to notify those verifiers authorized to use the public-keycertificates.

Certificates of the proposed form will be issued by the certificationcomponent, acting as a certificate server as shown in FIG. 12. As thoseskilled in the art will appreciate, the server will comprise a series oflogic modules that can be implemented in software, hardware, or acombination thereof. The user who wishes to be certified will submit adigitally signed request for such as input 1210 to the certificateserver 1200. Such a request would typically contain the user's publickey that is to be certified, along with his name or other identifyingattributes. The certificate server would verify the user's digitalsignature using the submitted public key. If the signature verifiescorrectly, the server would check the user's identity information in thedatabase 1220, and then issue a public key certificate 1230 of theproposed form as output. Those skilled in the art will recognize thatthe user identity database could be supplanted by other sources ofinformation to verify the identity of the user requesting thecertificate.

An alternate realization of the pseudo-public certificate server couldinvolve a modification unit to be attached to a conventional certificateserver. Such an add-on unit could operate on the input or the output ofthe conventional certificate server. In the event the modification unitoperates on the input, it would repackage the request for thecertificate by encrypting the users public key, and embed the encryptedpublic key among the identification attributes. The modification unitwould then attach a dummy public key to the request, sign the requestwith the associated private key and pass on the request to theconventional certificate server. The output of the conventionalcertificate server would be a certificate containing the encryptedpublic key of the user as one of the identifying attributes. In theevent the modification unit operates on the output of a conventionalcertificate server, the unit would repackage the conventionalcertificate produced by the conventional certificate server byencrypting the public-key exponent in the certificate in situ, and thenoverwriting the signature of the certificate server with a freshsignature of the modified certificate. Persons skilled in the art willappreciate that other alternative embodiments are possible.

3. Details of the Key Generation Component

This component generates the public and private key of a user at set-uptime, when the user creates his credentials. Public key creation(whether in the conventional sense or in the pseudo-public sense) inthis aspect of the present invention is generally similar toconventional key generation techniques, but with a slight modificationto resist the following attack.

a. Known Public Key Exponent Attack

This is an attack that is particular to the RSA cryptosystem, and is avariant of the known public key attack described above. In the RSAsystem, it is common to use public keys with simple, fixed exponents(e.g., 3 or 65537) to accelerate cryptographic operations.Unfortunately, this makes it possible for the malicious hacker to mounta known public key attack. The hacker will try all possible PINs on thekey wallet, and for each pseudo-valid PIN, he would extract thedecrypted private key and separate it into the private exponent and themodulus. Since a RSA public key consists of the known exponent and thesame modulus, the hacker can combine the two to assemble a candidatepublic key. He would then mount the known public key attack describedabove. In order to resist this attack, the key generation aspect of thepresent invention can utilize public keys with long exponents, say64-128 bits, that are generated randomly at key generation time.

4. Details of the Verification Component

The verification component of the present invention differs in two waysfrom the verification component in conventional systems. Theverification component must respect the pseudo-public nature of thepublic key certificate, and take appropriate steps to extract a user'spublic key from the certificate before verifying the user's signature.In an exemplary embodiment of this aspect of the invention, these wouldinclude receiving a certificate containing an encrypted pseudo-publickey of the certificate holder, and using the private key of anauthorized verifier to decrypt the pseudo-public key. The verificationcomponent would then use the pseudo-public key to verify a digitalsignature in a message sent by the certificate holder. In an alternativeembodiment, if a DES key had been used to encrypt the pseudo-public key,the DES key would first be decrypted using the private key of theverifier, and in turn the DES key used to decrypt the pseudo-public key.No matter what the decryption mechanism, the verification componentshould also include logic to detect break-in attempts by fraudulenthackers, e.g., those signing messages with incorrect candidate privatekeys corresponding to the pseudo-valid access codes of the key walletaspect of the present invention. In such a case, a fraudulent hackermight steal or otherwise obtain the legitimate user's pseudo-publiccertificate and send the certificate along with a fraudulent messagesigned with the incorrect candidate private key. The inconsistencybetween the legitimate user's correct pseudo-public key in thecertificate and the incorrect candidate private key allows detection ofthe fraudulent user. In particular, in one embodiment, if a particularuser's signature is not verified in three successive attempts, theverification component concludes that a break-in might be in progress,and freezes the user's access privileges pending further investigation.In addition to (or instead of) freezing the access, the verificationcomponent might sound an alarm alerting an operator of the attemptedbreak-in. There are other methods of detecting break-in attempts at theverification component, and other possible courses of action upondetecting a break-in. As those skilled in the art will appreciate, theverification component will compromise a series of logic modules thatcan be implemented in software, hardware, or a combination thereof.

5. Modifications, Enhancements and Alternate Embodiments

The foregoing has described various aspects of the present invention.Although in one preferred embodiment, the key wallet, the key generationcomponent, the key verification component and the key certificationcomponent are all used together to provide a secure technology forcryptographic key storage and use, those skilled in the art willappreciate that in alternative embodiments, various subsets of the wholesystem may also be combined for particular applications not requiringall of the components.

In addition, although all of the foregoing has been described withrespect to a software-based system, this is not strictly necessary. Forexample, some or all of the components could be deployed using microcodeand PLAs or ROMs, general purpose programming language and generalpurpose microprocessors, or ASICs. That is, the invention is not limitedto software per se, but could be deployed in virtually any form oflogic, including pure software, a combination of software and hardware,or even hardware alone.

Furthermore, although various embodiments or aspects have been describedwith regard to RSA cryptography (for the public and/or pseudo-publickeys and public and/or pseudo-public certificates) or DES cryptography(for the PIN encryption and storage of the pseudo-public key on thepseudo-public certificate), those skilled in the art will appreciatethat many modifications and enhancements to such exemplary cryptographictechnology are possible. More generally, each of the aforementionedoperations can be implemented from a broad choice of cryptographictechniques, including many kinds of asymmetric or symmetric encryptionas well as CRCs, hashes, message digests, or other one-way functions.For example, an asymmetric encryption operation could be replaced with a(optionally keyed) one-way function where integrity is the primaryconcern, or encryption of a symmetric session key followed by use of thesession key for plaintext encryption, and various other alternativesthat are well-known to those skilled in the art. Finally, although theexemplary embodiment has been described with respect to PINs protectinga private key, those skilled in the art will realize that the sametechnology of cryptographic camouflaging can be used with other types ofaccess codes and cryptographic representations to protect anyaccess-controlled datum. Therefore, it is intended that the scope of theinvention be limited only by the claims appended below.

What is claimed is:
 1. An apparatus for managing access to acryptographically secured access-controlled datum, comprising: (a)computer-implemented input logic means for receiving a candidate accesscode; (b) a first computer memory configured to store acryptographically camouflaged access-controlled datum; (c)computer-implemented first cryptographic logic means operativelyconnected to said input logic means, and to said first computer memory,for processing said cryptographically camouflaged access-controlleddatum using said candidate access code, said processing inhibiting thedetection of cryptographic camouflaging by a fraudulent provider of saidcandidate access code by preserving a structural homogeneitycorresponding to a pre-camouflaged state of said access-controlleddatum; and (d) computer-implemented output logic means for providingsaid processed access-controlled datum to a user of said apparatus. 2.The apparatus of claim 1 wherein: (a) said access-controlled datum hasbeen at least partially encrypted using an access code; (b) a secondcomputer memory configured to store a cryptographic representation ofsaid access code; (c) said computer-implemented first cryptographiclogic means includes: (i) computer-implemented second cryptographiclogic means operatively connected to said computer-implemented inputlogic means and configured to regenerate said cryptographicrepresentation of said access code in response to said candidate accesscode belonging to a plurality of pseudo-valid access codes; and (ii)computer-implemented third cryptographic logic means configured toreceive said regenerated cryptographic representation from saidcomputer-implemented second cryptographic logic means, and operativelyconnected to said first computer memory and to said computer-implementedinput logic means for using said received candidate access code indecrypting said stored encrypted access-controlled datum to produce adecrypted access-controlled datum.
 3. The apparatus of claim 2 whereinsaid access-controlled datum is a cryptographic key.
 4. The apparatus ofclaim 3 wherein said cryptographic key is a private key.
 5. Theapparatus of claim 4 further comprising a pseudo-public keycorresponding to said private key.
 6. The apparatus of claim 5 furthercomprising a pseudo-public certificate containing said pseudo-publickey.
 7. The apparatus of claim 6 wherein said pseudo-public key isencrypted.
 8. The apparatus of claim 7 wherein said pseudo-public key isencrypted with a public key having a corresponding private key that isnot known except to authorized verifiers.
 9. The apparatus of claim 4wherein said private key is well-formed.
 10. The apparatus of claim 9wherein said private key includes a well-formed modulus, and an exponentsmaller than said modulus.
 11. The apparatus of claim 9 wherein saidprivate key includes: (a) a cleartext representation of said modulus;and (b) a cryptographic representation of at least a part of an exponentcorresponding to said modulus.
 12. The apparatus of claim 11: (a)further comprising a third computer memory for storing a number largerthan said exponent and smaller than said modulus; and (b) wherein saidat least part of said exponent is stored in an expanded form which, whenevaluated modulo said number, equals said at least part of saidexponent.
 13. The apparatus of claim 11 wherein said at least part ofsaid exponent represents certain less significant bits of said exponent.14. The apparatus of claim 3 wherein said second computer-implementedcryptographic logic means for said regeneration of said cryptographicrepresentation of said access code includes a many-to-one hash.
 15. Theapparatus of claim 14 wherein said many-to-one hash is characterized inthat said plurality of pseudo-valid access codes are scattered among aplurality of invalid access codes.
 16. The apparatus of claim 2 wherein:(a) said cryptographic representation includes a hash function; and (b)said second computer-implemented cryptographic logic means for saidregeneration of said cryptographic representation includes a many-to-onehash.
 17. The apparatus of claim 16 wherein said access-controlled datumis a private key.
 18. The apparatus of claim 17 wherein said private keyis well-formed.
 19. The apparatus of claim 17 further comprising digitalsigning logic means including: (a) computer-implemented input logicmeans for receiving a message to be signed; (b) randomizing logic meansfor generating random data; and (c) computer-implemented fourthcryptographic logic means operatively connected to saidcomputer-implemented input logic means and to said randomizing logicmeans for: (i) padding said received message with said generated randomdata; and (ii) signing said padded message with said decryptedaccess-controlled datum.
 20. The apparatus of claim 17 furthercomprising a pseudo-public key corresponding to said private key. 21.The apparatus of claim 16 wherein said many-to-one hash is characterizedin that said plurality of pseudo-valid access codes are scattered amonga plurality of invalid access codes.
 22. The apparatus of claim 1wherein said stored access-controlled datum is a private key having acorresponding public key that includes an exponent of at least 64 bits.23. The apparatus of claim 2 wherein said computer-implemented thirdcryptographic logic means is configured to disallow said decryption whensaid received candidate access code is an invalid access code.
 24. Theapparatus of claim 2 implemented as a software program interacting witha computer.
 25. The apparatus of claim 2 implemented as a hardwaredevice.
 26. The apparatus of claim 2 further comprising digital signinglogic means including: (a) computer-implemented input logic means forreceiving a message to be signed; (b) randomizing logic means forproviding random data; and (c) computer-implemented fourth cryptographiclogic means operatively connected to said input logic and to saidrandomizing logic means for: (i) padding said received message with saidgenerated random data; and (ii) signing said padded message with saiddecrypted access-controlled datum.
 27. The apparatus of claim 26 whereinsaid generated random data arises from a source outside of saidapparatus.
 28. The apparatus of claim 26 wherein said generated randomdata originates from a physical source.
 29. The apparatus of claim 2wherein said computer-implemented third cryptographic logic means fordecrypting includes a symmetric cryptographic function.
 30. Theapparatus of claim 29 wherein said symmetric cryptographic function isDES.
 31. A cryptographic key wallet comprising: (a) computer-implementedinput logic means for receiving a user-inputted access code that maybelong to a plurality of pseudo-valid access codes; (b)computer-implemented cryptographic logic means for inhibiting thedetection of cryptographic camouflaging by a fraudulent inputter of oneof said pseudo-valid access codes by: (i) cryptographically verifyingsaid inputted pseudo-valid access code; and (ii) decrypting acryptographically-camouflaged access-controlled datum using saidinputted pseudo-valid access code to produce a decryptedaccess-controlled datum having a structural homogeneity corresponding toa pre-camouflaged state of said access-controlled datum; and (c)computer-implemented output logic means for providing said decryptedaccess-controlled datum to said user.
 32. The cryptographic key walletof claim 31 wherein said access-controlled datum includes a private keyhaving a corresponding pseudo-public key.
 33. The cryptographic keywallet of claim 32 further comprising a pseudo-public certificatecontaining said pseudo-public key.
 34. A digital certificate servercomprising: (a) computer-implemented input logic means for receivingfrom a requester a digitally signed request for a pseudo-public digitalcertificate, said request including: (i) a pseudo-public key to becertified, and (ii) an identifying attribute of said requestor; (b)computer-implemented cryptographic logic means for verifying saiddigitally signed request using said pseudo-public key; (c)computer-implemented logic means for creating said pseudo-publiccertificate upon said verifying said digitally signed request, saidcertificate including said pseudo-public key encrypted under acryptographic key whose corresponding decryption key is available onlyto authorized verifiers; and (d) computer-implemented output logic meansfor providing said pseudo-public certificate for said requestor.
 35. Thedigital certificate server of claim 34 implemented as an add-on modulefor use with a conventional digital certificate server.
 36. The digitalcertificate server of claim 34 configured for use with a digital wallet,said digital wallet comprising: (a) computer-implemented input logicmeans for receiving a candidate access code; (b) a first computer memoryconfigured to store a cryptographically camouflaged access-controlleddatum; (c) computer-implemented first cryptographic logic meansoperatively connected to said computer-implemented input logic means andsaid first computer memory for processing said cryptographicallycamouflaged access-controlled datum using said candidate access code;and (d) computer-implemented output logic means for providing saidprocessed datum access-controlled datum to a user of said apparatus. 37.The digital certificate server of claim 34 wherein said pseudo-publiccertificate is of a modified conventional format.
 38. The digitalcertificate server of claim 34 wherein said pseudo-public key isencrypted.
 39. The digital certificate server of claim 38 wherein saidpseudo-public key is encrypted with a public key having a correspondingprivate key that is not known except to authorized verifiers. 40.Apparatus for verifying a digitally-signed message, comprising: (a)computer-implemented input logic means for receiving a digitally-signedmessage and a pseudo-public key allegedly corresponding to a signer ofsaid message, said pseudo-public key encrypted under a cryptographic keywhose corresponding decryption key is available only to authorizedverifiers; (b) computer-implemented cryptographic logic means for usinga decryption key of at least one of said authorized verifiers tocryptographically recover the pseudo-public key; and (c)computer-implemented signalling logic means for detecting fraudulent useof said message upon failure of said verified pseudo-public key tosuccessfully verify said signed message.
 41. The apparatus of claim 40wherein said received pseudo-public key is contained in a pseudo-publiccertificate.
 42. The apparatus of claim 40 wherein said digitally-signedmessage is signed using a candidate private key that was generated by acryptographic key wallet in response to a pseudo-valid access code. 43.The apparatus of claim 42 wherein said key wallet includes: (a)computer-implemented input logic means for receiving a candidate accesscode; (b) a first computer memory configured to store acryptographically camouflaged access-controlled datum; (c)computer-implemented first cryptographic logic means operativelyconnected to said computer-implemented input logic means and said firstcomputer memory for processing said cryptographically camouflagedaccess-controlled datum using said candidate access code; and (d)computer-implemented output logic means for providing said processeddatum access-controlled datum to a user of said apparatus.
 44. Theapparatus of claim 40 wherein said logic for detecting said fraudulentuse includes computer-implemented logic means for freezing access tosaid apparatus upon a plurality of unsuccessful attempted verifications.45. The apparatus of claim 40 wherein said logic means for detectingsaid fraudulent use includes computer-implemented logic means foreffecting an alarm upon unsuccessful attempted verification.
 46. Theapparatus of claim 40 wherein said decryption key is a private key of aprivate-public key pair of at least one of said authorized verifiers.47. A method for providing a stored cryptographically-securedaccess-controlled datum, comprising the steps of: (a) receiving acandidate access code from a user of a digital wallet; (b) accessing astored, cryptographically camouflaged access-controlled datum; (c)cryptographically processing said cryptographically camouflagedaccess-controlled datum using said candidate access code, saidprocessing inhibiting the detection of cryptographic camouflaging by afraudulent provider of said candidate access code by preserving astructural homogeneity corresponding to a pre-camouflaged state of saidaccess-controlled datum; and (d) providing said processedaccess-controlled datum to said user of said wallet.
 48. The method ofclaim 47 wherein said step of cryptographically processing saidcryptographically camouflaged access-controlled datum using saidcandidate access code includes: (a) accessing from a first memory withina digital wallet, an access-controlled datum that has been at leastpartially encrypted using an access code; (b) accessing from a secondmemory within said digital wallet, a cryptographic representation ofsaid access code; (c) regenerating said cryptographic representation ofsaid access code in response to said candidate access code belonging toa plurality of pseudo-valid access codes; and (d) using said receivedcandidate access code, decrypting said encrypted access-controlled datumto produce a decrypted access-controlled datum.
 49. The method of claim48 wherein said access-controlled datum is a cryptographic key.
 50. Themethod of claim 49 wherein said stored access-controlled datum is aprivate key having a corresponding public key that includes a longexponent.
 51. The method of claim 49 wherein said cryptographic key is aprivate key.
 52. The method of claim 51 wherein said private key is amember of a cryptographic key pair including a pseudo-public keycorresponding to said private key.
 53. The method of claim 52 whereinsaid digital wallet includes a pseudo-public certificate containing saidpseudo-public key.
 54. The method of claim 53 wherein said pseudo-publickey is encrypted.
 55. The method of claim 54 wherein said pseudo-publickey is encrypted with a public key having a corresponding private keythat is not known except to authorized verifiers.
 56. The method ofclaim 52 wherein said private key is well-formed.
 57. The method ofclaim 56 wherein said private key includes a well-formed modulus, and anexponent smaller than said modulus.
 58. The method of claim 56 whereinsaid private key includes: (a) a cleartext representation of saidmodulus; and (b) a cryptographic representation of at least a part of anexponent corresponding to said modulus.
 59. The method of claim 58wherein: (a) said private key is stored in said first memory as anexpanded form of at least part of said exponent; and (b) said step ofdecrypting said encrypted access-controlled datum includes: (i)retrieving from a third memory a number larger than said exponent andsmaller than said modulus; (ii) retrieving said expanded form of atleast part of said exponent from said first memory; and (iii) evaluatingsaid expanded form of at least part of said exponent, modulo saidnumber, to recover said at least part of said exponent.
 60. The methodof claim 58 wherein said at least part of said exponent representscertain less significant bits of said exponent.
 61. The method of claim51 wherein said step of regenerating said cryptographic representationof said access code includes performing a many-to-one hash.
 62. Themethod of claim 61 wherein said many-to-one hash is characterized inthat said plurality of pseudo-valid access codes are scattered among aplurality of invalid access codes.
 63. The method of claim 49 wherein:(a) said cryptographic representation includes a hash function; and (b)said step of regenerating said cryptographic representation of saidaccess code includes performing a many-to-one hash.
 64. The method ofclaim 63 wherein said many-to-one hash is characterized in that saidplurality of pseudo-valid access codes are scattered among a pluralityof invalid access codes.
 65. The method of claim 63 wherein saidaccess-controlled datum is a private key.
 66. The method of claim 65further comprising the steps of: (a) receiving a message to be signed;(b) generating random data; (c) padding said received message with saidgenerated random data; and (d) signing said padded message with saiddecrypted access-controlled datum.
 67. The method of claim 65 whereinsaid private key is a member of a cryptographic key pair including apseudo-public key corresponding to said private key.
 68. The method ofclaim 65 wherein said private key is well-formed.
 69. The method ofclaim 49 implemented via a hardware device.
 70. The method of claim 49wherein said step of decrypting said access-controlled datum isdisallowed when said received candidate access code is an invalid accesscode.
 71. The method of claim 49 implemented as a software program. 72.The method of claim 49 further comprising the steps of: (a) receiving amessage to be signed; (b) generating random data; (c) padding saidreceived message with said generated random data; and (d) signing saidpadded message with said decrypted access-controlled datum.
 73. Themethod of claim 72 wherein said generated random data arises from asource outside of said apparatus.
 74. The method of claim 72 whereinsaid generated random data originates from a physical source.
 75. Themethod of claim 49 wherein said step of decrypting said encryptedaccess-controlled datum includes performing a symmetric cryptographicoperation thereon.
 76. The method of claim 75 wherein said symmetriccryptographic operation is DES.
 77. A method for providing a storedcryptographically-secured access-controlled datum, comprising the stepsof: (a) receiving, at a digital wallet, a user-inputted access code thatmay belong to a plurality of pseudo-valid access codes; (b) inhibitingthe detection of cryptographic camouflaging by a fraudulent inputter ofone of said pseudo-valid access codes by: (i) cryptographicallyverifying said inputted pseudo-valid access code; and (ii) decrypting acryptographically-camouflaged access-controlled datum using saidinputted pseudo-valid access code to produce a decryptedaccess-controlled datum having a structural homogeneity corresponding toa pre-camouflaged state of said access-controlled datum; and (c)providing said decrypted access-controlled datum to said user of saiddigital wallet.
 78. The method of claim 77 wherein saidaccess-controlled datum includes a private key having a correspondingpseudo-public key.
 79. The method of claim 78 wherein said digitalwallet includes a pseudo-public certificate containing saidpseudo-public key.
 80. A method for generating a pseudo-public digitalcertificate comprising the steps of: (a) receiving from a requestor adigitally signed request for a pseudo-public digital certificate, saidrequest including: (i) a pseudo-public key to be certified, and (ii) anidentifying attribute of said requestor; (b) cryptographically verifyingsaid digitally signed request using said pseudo-public key; (c) creatingsaid pseudo-public certificate upon said verifying said digitally signedrequest, said certificate including said pseudo-public key encryptedunder a cryptographic key whose corresponding decryption key isavailable only to authorized verifiers; and (d) outputting saidpseudo-public certificate for said requestor.
 81. The method of claim 80further comprising the step of placing said created digital certificatein a digital wallet, said digital wallet comprising: (a)computer-implemented input logic means for receiving a candidate accesscode; (b) a first computer memory configured to store acryptographically camouflaged access-controlled datum; (c)computer-implemented first cryptographic logic means operativelyconnected to said input logic means and said first computer memory forprocessing said cryptographically camouflaged access-controlled datumusing said candidate access code; and (d) computer-implemented outputlogic means for providing said processed access-controlled datum to auser of said apparatus.
 82. The method of claim 80 wherein saidpseudo-public certificate is of a modified conventional format.
 83. Theapparatus of claim 82 wherein said pseudo-public key is encrypted. 84.The method of claim 83 wherein: (a) said pseudo-public key is encryptedwith a public key having a corresponding private key that is not knownexcept to authorized verifiers.
 85. The method of claim 80 performed viaan add-on module for use with a conventional digital certificate server.86. A method for verifying a digitally-signed message, comprising thesteps of: (a) receiving, at a message verification apparatus, adigitally-signed message and a pseudo-public key allegedly correspondingto a signer of said message, said pseudo-public key encrypted under acryptographic key whose corresponding decryption key is available onlyto authorized verifiers; (b) using a decryption key of at least one ofsaid authorized verifiers to cryptographically recover the pseudo-publickey; and (c) detecting fraudulent use of said message upon failure ofsaid verified pseudo-public key to successfully verify said signedmessage.
 87. The method of claim 86 wherein said decryption key is aprivate key of a private-public key pair of at least one of saidauthorized verifiers.
 88. The apparatus of claim 86 wherein saidreceived pseudo-public key is contained in a pseudo-public certificate.89. The method of claim 86 wherein said digitally-signed message issigned using a candidate private key that was generated by acryptographic key wallet in response to a pseudo-valid access code. 90.The method of claim 89 wherein said key wallet includes: (a)computer-implemented input logic means for receiving a candidate accesscode; (b) a first computer memory configured to store acryptographically camouflaged access-controlled datum; (c)computer-implemented first cryptographic logic means operativelyconnected to said input logic means and said first computer memory forprocessing said cryptographically camouflaged access-controlled datumusing said candidate access code; and (d) computer-implemented outputlogic means for providing said processed access-controlled datum to auser of said apparatus.
 91. The method of claim 86 wherein said step ofdetecting said fraudulent use includes freezing access to said messageverification apparatus upon a plurality of unsuccessful attemptedverifications.
 92. The method of claim 86 wherein said step of detectingsaid fraudulent use includes effecting an alarm upon unsuccessfulattempted verification.
 93. A method for storing a storedcryptographically-secured access-controlled datum, comprising the stepsof: (a) receiving an access-controlled datum; (b) cryptographicallycamouflaging said access-controlled datum such to be recognizable by anauthorized user thereof but unrecognizable to an unauthorized userthereof by preserving a structural homogeneity corresponding to apre-camouflaged state of said access-controlled datum; and (c) storingsaid camouflaged access-controlled datum in a digital wallet.
 94. Themethod of claim 93 wherein said step of cryptographically camouflagingsaid access-controlled datum includes: (a) receiving an access code; (b)computing a cryptographic representation of said access code, saidrepresentation having the property of being reproducible in response toa plurality of pseudo-valid access codes; (c) storing said computedcryptographic representation of said access code; (d) at least partiallyencrypting said access-controlled datum using said access code; (e)storing said at least partially encrypted access-controlled datum forsubsequent access by a user providing one of said plurality of saidpseudo-valid access codes.
 95. The method of claim 94 wherein saidaccess-controlled datum is a cryptographic key.